Calculating Machines

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Calculating Machines and Mechanical Translation

As far as can be traced, the first suggestion that translation —from foreign language (for which the letters F.L. will afterwards be used as a convenient abbreviation) into a target language (T.L.)—could be achieved by means of a digital calculating machine was made by the present author in 1947. The scheme, as it was then envisaged, merely consisted of using the storage unit of a modern comput...

متن کامل

On State Machines of Calculating Type

In this article, we show the properties of the calculating type state machines. In the first section, we have defined calculating type state machines of which the state transition only depends on the first input. We have also proved theorems of the state machines. In the second section, we defined Moore machines with final states. We also introduced the concept of result of the Moore machines. ...

متن کامل

State Machines of Calculating Type and Their Correctness

In this paper, we define the “correctness” of a state machine based on a discussion of the “result” yielding from its final states. For simplicity, we define a state machine called a “calculating type state machine” that can calculate a simple issue and show some examples of correct calculating type state machines.

متن کامل

Five 1951 BBC Broadcasts on Automatic Calculating Machines

Researchers of Britain’s early postwar history of computing have known for some time that a series of five British Broadcasting Corporation (BBC) radio broadcasts under the general title of “Automatic Calculating Machines” was broadcast on the BBC’s Third Programme radio service in May–June 1951. In these broadcasts, five British pioneers of computing spoke about their work. In the order of the...

متن کامل

Calculating Accumulations 1 Calculating Accumulations

The accumulation strategy consists of generalizing a function over an algebraic data structure by inclusion of an extra parameter, an accumulating parameter, for reusing and propagating intermediate results. It is one of the standard optimization techniques taught to functional programmers 13). However , there remain two major diculties in this accumulation strategy. One is to determine where a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 1917

ISSN: 0028-0836,1476-4687

DOI: 10.1038/099384b0